Reachability-based model reduction for Markov decision process
نویسندگان
چکیده
منابع مشابه
Structured Reachability Analysis for Markov Decision Processes
Recent research in decision theoretic planning has focussed on making the solution of Markov decision processes (MDPs) more feasible. We develop a family of algorithms for structured reachability analysis of MDPs that are suitable when an initial state (or set of states) is known. Using compact, structured representations of MDPs (e.g., Bayesian networks), our methods, which vary in the tradeof...
متن کاملModel-based Bayesian Reinforcement Learning in Factored Markov Decision Process
Learning the enormous number of parameters is a challenging problem in model-based Bayesian reinforcement learning. In order to solve the problem, we propose a model-based factored Bayesian reinforcement learning (F-BRL) approach. F-BRL exploits a factored representation to describe states to reduce the number of parameters. Representing the conditional independence relationships between state ...
متن کاملModel Reduction Techniques for Computing ApproximatelyOptimal Solutions for Markov Decision
We present a method for solving implicit (factored) Markov decision processes (MDPs) with very large state spaces. We introduce a property of state space partitions which we call-homogeneity. Intuitively, an-homogeneous partition groups together states that behave approximately the same under all or some subset of policies. Borrowing from recent work on model minimization in computer-aided soft...
متن کاملReachability Analysis of Quantum Markov Decision Processes
We introduce the notion of quantum Markov decision process (qMDP) as a semantic model of nondeterministic and concurrent quantum programs. It is shown by examples that qMDPs can be used in analysis of quantum algorithms and protocols. We study various reachability problems of qMDPs both for the finite-horizon and for the infinite-horizon. The (un)decidability and complexity of these problems ar...
متن کاملReachability in Recursive Markov Decision Processes
We consider a class of infinite-state Markov decision processes generated by stateless pushdown automata. This class corresponds to 112 -player games over graphs generated by BPA systems or (equivalently) 1-exit recursive state machines. An extended reachability objective is specified by two sets S and T of safe and terminal stack configurations, where the membership to S and T depends just on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Brazilian Computer Society
سال: 2015
ISSN: 0104-6500,1678-4804
DOI: 10.1186/s13173-015-0024-1